Qualitative properties of $\alpha$-fair policies in bandwidth-sharing networks
نویسندگان
چکیده
منابع مشابه
Qualitative Properties of Α-fair Policies in Bandwidth-sharing Networks
We consider a flow-level model of a network operating under an α-fair bandwidth sharing policy (with α > 0) proposed by Roberts and Massoulié (2000). This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows in a communication network. We study the transient properties as well as the steady-state distribution of the model. In particular, for α...
متن کاملFair Bandwidth Sharing Among Virtual Networks: A Capacity Resizing Approach
Virtual Private Networks (VPN) and link sharing are cost effective way of realizing corporate intranets. Corporate intranets will increasingly have to provide Integrated Services for voice and multimedia traffic. Although packet scheduling algorithms can be used to implement Integrated Services in link sharing [1] and virtual private networks [2], their statistical multiplexing gains are limite...
متن کاملTraffic-Splitting Networks Operating under Alpha-fair Sharing Policies and Balanced Fairness
We consider a data network in which, besides classes of users that use specific routes, one class of users can split its traffic over several routes. We consider load balancing at the packetlevel, implying that traffic of this class of users can be divided among several routes at the same time. Assuming that load balancing is based on an alpha-fair sharing policy, we show that the network has m...
متن کاملRainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechanisms. Traditional mechanisms to achieve fair sharing (e.g., Weighted Fair Queueing, Flow Random Early Discard) require per-flow state to determine which packets to drop under congestion, and therefore are complex to implement at t...
متن کاملWeighted fair bandwidth sharing using SCALE technique
Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: 1) A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair bandwidth-Sharing, is presented to achieve near-optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2014
ISSN: 1050-5164
DOI: 10.1214/12-aap915